Modifying Boolean Functions to Ensure Maximum Algebraic Immunity
نویسندگان
چکیده
The algebraic immunity of cryptographic Boolean functions is studied in this paper. Proper modifications of functions achieving maximum algebraic immunity are proved, in order to yield new functions of also maximum algebraic immunity. It is shown that the derived results apply to known classes of functions. Moreover, two new efficient algorithms to produce functions of guaranteed maximum algebraic immunity are developed, which further extend and generalize known constructions of functions with maximum algebraic immunity.
منابع مشابه
Construction and Count of Boolean Functions of an Odd Number of Variables with Maximum Algebraic Immunity
Algebraic immunity has been proposed as an important property of Boolean functions. To resist algebraic attack, a Boolean function should possess high algebraic immunity. It is well known now that the algebraic immunity of an n-variable Boolean function is upper bounded by ⌈ n 2 ⌉ . In this paper, for an odd integer n, we present a construction method which can efficiently generate a Boolean fu...
متن کاملConstruction and Analysis of Boolean Functions of 2t+1 Variables with Maximum Algebraic Immunity
In this paper, we study the construction of (2t+ 1)-variable Boolean functions with maximum algebraic immunity, and we also analyze some other cryptographic properties of this kind of functions, such as nonlinearity, resilience. We first identify several classes of this kind of functions. Further, some necessary conditions of this kind of functions which also have higher nonlinearity are obtain...
متن کاملConstruction of Rotation Symmetric Boolean Functions with optimal Algebraic Immunity Construcción de Funciones Booleanas de Rotación Simétrica con Inmunidad Algebraica Óptima
In this paper, we present theoretical constructions of Rotation Symmetric Boolean Functions (RSBFs) on odd number of variables with the maximum possible algebraic immunity. To get high nonlinearity, we generalize our construction to a search technique in the RSBF class. We present RSBFs with the maximum algebraic immunity and high nonlinearity for odd number of variables. We also study the RSBF...
متن کاملLower Bounds on Algebraic Immunity of Boolean Functions
In the recently developed algebraic attacks applying to block and stream ciphers([1-5]), the concept of algebraic immunity (AI) is introduced in [6] and studied in [6-14]. High algebraic immunity is a necessary condition for resisting algebraic attacks. In this paper, we give some lower bounds on algebraic immunity of Boolean functions. The results are applied to give lower bounds on AI of symm...
متن کاملConstructing and Counting Even-Variable Symmetric Boolean Functions with Algebraic Immunity not Less Than $d$
In this paper, we explicitly construct a large class of symmetric Boolean functions on 2k variables with algebraic immunity not less than d, where integer k is given arbitrarily and d is a given suffix of k in binary representation. If let d = k, our constructed functions achieve the maximum algebraic immunity. Remarkably, 22 k⌋+2 symmetric Boolean functions on 2k variables with maximum algebra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2012 شماره
صفحات -
تاریخ انتشار 2012